منابع مشابه
Communication-Efficient Parallel Sorting
We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most h items in any round. We provide parallel sorting methods that use internal computation time that is O(*) and a number of communication rounds ...
متن کاملMore Efficient Parallel Integer Sorting
We present a more efficient CREW PRAM algorithm for integer sorting. This algorithm sorts n integers in {0, 1, 2, ..., n} in O((log n)/ log log n) time and O(n(log n/ log log n)) operations. It also sorts n integers in {0, 1, 2, ..., n− 1} in O((log n)/ log log n) time and O(n(log n/ log log n) log log log n) operations. Previous best algorithm [13] on both cases has time complexity O(log n) bu...
متن کاملAn efficient external sorting algorithm
This paper presents an optimal external sorting algorithm for two-level memory model. Our method is different from the traditional external merge sort and it uses the sampling information to reduce the disk I/Os in the external phase. The algorithm is efficient, simple and it makes a good use of memory available in the recent computer environment. Under the certain memory constraint, this algor...
متن کاملEnergy-Efficient Fast Sorting 2011
Authors of this report participated in the Sort Benchmark contests in 2009 and 2010. In 2009, our DEMSort program took the lead in the then-new Indy Gray category [RSSK09, RSS10], sorting 100 TB on a cluster with about 200 nodes. A tie was declared with Yahoo, whose Hadoop-based program achieved about the same result in the Daytona class, but with 17 times the hardware effort. Former results in...
متن کاملDepth Optimized Efficient Homomorphic Sorting
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is obtained by focusing on the multiplicative depth of the sorting circuit alongside the more traditional metrics such as number of comparisons and number of iterations. The reduced depth allows much reduced noise growth and thereby makes it possible to select smaller param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2006
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539704446554